Circuit Lower Bounds Collapse Relativized Complexity Classes
نویسندگان
چکیده
Since the publication of Furst, Saxe, and Sipser's seminal paper connecting AC 0 with the polynomial hierarchy FSS84], it has been well known that circuit lower bounds allow you to construct oracles that separate complexity classes. We will show that similar circuit lower bounds allow you to construct oracles that collapse complexity classes. For example, based on H astad's parity lower bound, we construct an oracle such that P = PH P = EXP.
منابع مشابه
The Power of Natural Properties as Oracles
We study the power of randomized complexity classes that are given oracle access to a natural property of Razborov and Rudich (JCSS, 1997) or its special case, the Minimal Circuit Size Problem (MCSP). We obtain new circuit lower bounds, as well as some hardness results for the relativized version of MCSP under randomized reductions. For example, we show that
متن کاملOn Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy
We consider the problem of proving circuit lower bounds against the polynomialtime hierarchy. We first revisit a lower bound given by Kannan [Kan82], and for any fixed integer k > 0, we give an explicit Σp2 language, recognizable by a Σ p 2-machine with running time O(nk 2+k), that requires circuit size > nk. Next, as our main results, we give relativized results showing the difficulty of provi...
متن کاملRelativized Propositional Calculus
Motivation: Complexity lower bounds and independence results are easier in a relativized setting. It seems reasonable to define a relativized setting for the propositional calculus in order to prove lower bounds.
متن کاملImmunity and simplicity for exact counting and other counting classes
Ko [Ko90] and Bruschi [Bru92] independently showed that, in some relativized world, PSPACE (in fact, ⊕P) contains a set that is immune to the polynomial hierarchy (PH). In this paper, we study and settle the question of (relativized) separations with immunity for PH and the counting classes PP, C=P, and ⊕P in all possible pairwise combinations. Our main result is that there is an oracle A relat...
متن کاملInvestigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs
We investigate a hierarchy Gk (U; S) of classes of conjunctive normal forms, recognizable and SAT-decidable in polynomial time, with special emphasize on the corresponding hardness parameter hU ;S(F) for clause-sets F (the rst level of inclusion). At level 0 an (incomplete, poly-time) oracle U for unsatissability detection and an oracle S for satissability detection is used. The hierarchy from ...
متن کامل